Automated theorem proving

Results: 768



#Item
641Journal on Satisfiability, Boolean Modeling and Computation[removed]Complexity of Semialgebraic Proofs with Restricted Degree of Falsity∗† Edward A. Hirsch Arist Kojevnikov

Journal on Satisfiability, Boolean Modeling and Computation[removed]Complexity of Semialgebraic Proofs with Restricted Degree of Falsity∗† Edward A. Hirsch Arist Kojevnikov

Add to Reading List

Source URL: jsat.ewi.tudelft.nl

Language: English - Date: 2008-11-12 04:43:46
642A Non-commutative Extension of MELL Alessio Guglielmi and Lutz Straßburger Technische Universit¨at Dresden Fakult¨ at Informatik[removed]Dresden - Germany [removed] and Lutz.Strassburger@Inf.

A Non-commutative Extension of MELL Alessio Guglielmi and Lutz Straßburger Technische Universit¨at Dresden Fakult¨ at Informatik[removed]Dresden - Germany [removed] and Lutz.Strassburger@Inf.

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2005-12-02 04:44:23
643Inferring the Proof Process Andrius Velykis School of Computing Science, Newcastle University, UK [removed]  Abstract. This PhD project aims to investigate how enough information can be collected fr

Inferring the Proof Process Andrius Velykis School of Computing Science, Newcastle University, UK [removed] Abstract. This PhD project aims to investigate how enough information can be collected fr

Add to Reading List

Source URL: andrius.velykis.lt

Language: English - Date: 2014-04-07 06:29:40
644Why3: Shepherd Your Herd of Provers? Fran¸cois Bobot1,2 , Jean-Christophe Filliˆatre1,2 , Claude March´e2,1 , and Andrei Paskevich1,2 1  Lab. de Recherche en Informatique, Univ Paris-Sud, CNRS, Orsay, F-91405

Why3: Shepherd Your Herd of Provers? Fran¸cois Bobot1,2 , Jean-Christophe Filliˆatre1,2 , Claude March´e2,1 , and Andrei Paskevich1,2 1 Lab. de Recherche en Informatique, Univ Paris-Sud, CNRS, Orsay, F-91405

Add to Reading List

Source URL: proval.lri.fr

Language: English - Date: 2011-06-30 04:33:49
645A Finitely Axiomatized Formalization of Predicate Calculus with Equality Note: This is a preprint of Megill, “A Finitely Axiomatized Formalization of Predicate Calculus with Equality,” Notre Dame Journal of Formal Lo

A Finitely Axiomatized Formalization of Predicate Calculus with Equality Note: This is a preprint of Megill, “A Finitely Axiomatized Formalization of Predicate Calculus with Equality,” Notre Dame Journal of Formal Lo

Add to Reading List

Source URL: de.metamath.org

Language: English - Date: 2014-06-27 17:40:55
646Metamath A Computer Language for Pure Mathematics Norman Megill  ∼ Public Domain ∼

Metamath A Computer Language for Pure Mathematics Norman Megill ∼ Public Domain ∼

Add to Reading List

Source URL: de.metamath.org

Language: English - Date: 2014-06-27 17:40:55
647The Hob System for Verifying Software Design Properties by Patri
k Lam Submitted to the Department of Ele
tri
al Engineering and Computer

The Hob System for Verifying Software Design Properties by Patri k Lam Submitted to the Department of Ele tri al Engineering and Computer

Add to Reading List

Source URL: 21w.ca

Language: English - Date: 2014-02-12 18:13:43
    648The IMPS Bibliography William M. Farmer∗ Joshua D. Guttman†  Computing and Software

    The IMPS Bibliography William M. Farmer∗ Joshua D. Guttman† Computing and Software

    Add to Reading List

    Source URL: imps.mcmaster.ca

    Language: English - Date: 2012-03-27 15:38:49
    649Applications of Feasible Path Analysis to Program Testing Allen Goldberg, T.C. Wang, David Zimmerman* Kestrel Institute 3260 Hillview Avenue

    Applications of Feasible Path Analysis to Program Testing Allen Goldberg, T.C. Wang, David Zimmerman* Kestrel Institute 3260 Hillview Avenue

    Add to Reading List

    Source URL: www.agoldberg.org

    Language: English - Date: 2008-11-03 13:00:07